n=input()
times = input().split(' ')
times = list(map(int, times))
times.sort()
wait = 0
count = 0
for i in range(len(times)):
if times[i] >= wait:
wait += times[i]
count+=1
print(count)#include<bits/stdc++.h>
using namespace std;
int main(){
int n,sum,c=1;
cin >> n;
vector<int> a(n);
for(int &it:a) cin >> it;
sort(a.begin(),a.end());
sum= a.front();
//for(int &it:a) cout << it <<' ';
for(int i=1; i<n;){
auto it= lower_bound(a.begin()+i,a.end(),sum);
//cout << i << endl;
if(it==a.end()) break;
i=it-a.begin();
c++;
sum +=a[i];
}
cout << c;
}1342. Number of Steps to Reduce a Number to Zero | 1528. Shuffle String |
1365. How Many Numbers Are Smaller Than the Current Number | 771. Jewels and Stones |
1512. Number of Good Pairs | 672. Richest Customer Wealth |
1470. Shuffle the Array | 1431. Kids With the Greatest Number of Candies |
1480. Running Sum of 1d Array | 682. Baseball Game |
496. Next Greater Element I | 232. Implement Queue using Stacks |
844. Backspace String Compare | 20. Valid Parentheses |
746. Min Cost Climbing Stairs | 392. Is Subsequence |
70. Climbing Stairs | 53. Maximum Subarray |
1527A. And Then There Were K | 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers |
318. Maximum Product of Word Lengths | 448. Find All Numbers Disappeared in an Array |
1155. Number of Dice Rolls With Target Sum | 415. Add Strings |
22. Generate Parentheses | 13. Roman to Integer |
2. Add Two Numbers | 515. Find Largest Value in Each Tree Row |
345. Reverse Vowels of a String | 628. Maximum Product of Three Numbers |